A polynomial preconditioner for the GMRES algorithm
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولOn Worst-case Gmres, Ideal Gmres, and the Polynomial Numerical Hull of a Jordan Block
When solving a linear algebraic system Ax = b with GMRES, the relative residual norm at each step is bounded from above by the so-called ideal GMRES approximation. This worstcase bound is sharp (i.e. it is attainable by the relative GMRES residual norm) in case of a normal matrix A, but it need not characterize the worst-case GMRES behavior if A is nonnormal. Characterizing the tightness of thi...
متن کاملGGMRES: A GMRES--type algorithm for solving singular linear equations with index one
In this paper, an algorithm based on the Drazin generalized conjugate residual (DGMRES) algorithm is proposed for computing the group-inverse solution of singular linear equations with index one. Numerical experiments show that the resulting group-inverse solution is reasonably accurate and its computation time is significantly less than that of group-inverse solution obtained by the DGMRES alg...
متن کاملAn application of the UV-filtering preconditioner to the Polynomial Hybrid Monte Carlo algorithm
K-I. Ishikawa∗a†, S. Aokib,c, T. Ishikawad, N. Ishizukab,d , K. Kanayab, Y. Kuramashib,d , M. Okawaa, Y. Taniguchib,d , A. Ukawab,d, T. Yoshiéb,d aDepartment of Physics, Hiroshima University, Higashi-Hiroshima 739-8526, Japan bGraduate School of Pure and Applied Sciences, University of Tsukuba, Tsukuba 305-8571, Japan cRiken BNL Research Center, Brookhaven National Laboratory, Upton, NY 11973, ...
متن کاملA Polynomial Algorithm For
A polynomial algorithm is proposed for two scheduling problems for which the complexity status was open. A set of jobs with unit processing times, release dates and outtree precedence relations has to be processed on parallel identical machines such that the total completion time ∑ Cj is minimized. It is shown that the problem can be solved in O(n2) time if no preemption is allowed. Furthermore...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1995
ISSN: 0377-0427
DOI: 10.1016/0377-0427(94)00015-s